1.
algorithms
1.1.
search
1.1.1.
binary search
1.1.2.
binary vs linear search
1.1.3.
linear search
1.1.4.
search algorithms
1.2.
sort
1.2.1.
bubble sort
1.2.2.
comparison of sorting algorithms
1.2.3.
insertion sort
1.2.4.
merge sort
1.2.5.
sorting algorithms
2.
answers
2.1.
for loop answers
2.2.
if answers
3.
data representation
3.1.
compression
3.2.
images
3.3.
sound
4.
databases
4.1.
database
4.2.
sql
5.
defensive design
5.1.
errors
5.1.1.
logic error
5.1.2.
practice questions
5.2.
testing
6.
ethics
7.
hardware
7.1.
cpu
7.2.
multicore machines
7.3.
simple assembly maths
8.
logic
8.1.
boolean logic
8.2.
logic gates
8.3.
truth tables
9.
networking
9.1.
tcp
10.
number bases
10.1.
binary
10.2.
denary
10.3.
hexidecimal
10.4.
introduction
11.
programming
11.1.
data structures
11.1.1.
boolean
11.1.2.
list
11.1.3.
probabilistic filters
11.1.4.
string
11.2.
SUMMARY
11.3.
comment
11.4.
expression
11.5.
for loop
11.6.
function
11.7.
if
11.8.
indexing
11.9.
python basics
11.10.
variable
12.
programming languages
12.1.
ides
12.2.
translators
13.
questions
13.1.
online course
14.
thoughts
14.1.
things GCSE computer science students find difficult
15.
SUMMARY
16.
extension resources
17.
work in progress
Light (default)
Rust
Coal
Navy
Ayu
UK secondary Computer Science
In general: merge sort is faster than insertion sort which is faster than bubble sort.